A primal-dual algorithm for the fermat-weber problem involving mixed gauges

We give a new algorithm for solving the Fermat-Weber location problem involving mixed gauges. This algorithm, which is derived from the partial inverse method developed by J.E. Spingarn, simultaneously generates two sequences globally converging to a primal and a dual solution respectively. In addition, the updating formulae are very simple; a stopping rule can be defined though the method is not dual feasible and the entire set of optimal locations can be obtained from the dual solution by making use of optimality conditions. When polyhedral gauges are used, we show that the algorithm terminates in a finite number of steps, provided that the set of optimal locations has nonepty interior and a counterexample to finite termination is given in a case where this property is violated. Finally, numerical results are reported and we discuss possible extensions of these results.     

基于空间离散的最短路径求解法及其局部优化方法

提出了一种基于空间离散的最短路径求解法，该法利用复杂表面的空间离散信息，从已知的两点中估算与其相连的一点的距离，递推式求取一点与其他点之间的最短距离。计算获得了各点与起点和终点的距离后，再把它们相加，依据与起点的距离的大小，顺序把距离和最小的结点连接起来，这样获得了最短路径的邻域路径，然后对最短路径的邻域路径的各点进行迭代式更新，从而获得局部优化，最终获得最短路径。经过对例子的计算及分析，表明该方法普适性强、可靠及有效。     

一种求解虚波长路径光网络波长资源优化问题的启发式算法

本文提出了一种虚波长路径光网络的启发式路由选择算法,它可以用来解决以最小化网络所需波长数目为目标的资源优化问题.该算法应用了基于最大概率路径的选路优化策略.对一个样例网络的数值分析结果表明该算法是有效的.     

灵活的应用数学技术

E．E．Daivd指出“当今被称颂的高技术实质上是一种数学技术”，H．Neunzert称“数学是关键技术的关键”．这是人类对数学的新认识一数学既是科学又是技术．数学技术主要是指应用数学技术．它的高难度突出地体现在以解决实际问题为目标的研究上．这就必须灵活地运用数学思想和方法，抓住事物内在最本质的数学结构，提炼其特殊的数学模型，给出精巧的好算法并解决之．本文简述了华罗庚应用数学技术的特色、近期发展及其某些思想与新概念等．     

成组Broyden修正矩阵的紧凑形式与成组记忆修正算法

1 引言 成组型线性方程组 其中,p是适中的数值,由于其有相当的实际应用背景,人们一直在研究有效的数值方法,特别是近年来,实际问题中归结出来的成组型方程组,其规模越来越大,又具有稀疏结构,因而使用迭代法是一种有效的途径,目前使用比较多的是Krylov子空间方法中的Lanczos方法,CG方法,GMRES方法等等。这种成组型算法的建立,其基本出发点是使算法具有较少的计算量和存储量,具体体现在: 1)成组型算法在应用于问题(1.1)的求解时,也具有有限终止性性质,而其终止步数一般要比单个型算法的步数减少了户倍,由于成组型算法每迭代一步的计算量基本上等同于单个型算法使用户次的计算量,如此,算法的计算量会有明显的改善。 2)当A存储在二级(secondary)内存时,在迭代计算时需要不断地进行存取交换,由于成组型算法的迭代步数减少了户倍,如此,用在这种交换的时间也要减少户倍,相当有效。 3)由于在成组型算法中,出现的多是AX的形式,其中,故成组型算法便于计算并行化。 4)即使用于求解单个方程组,当A的少数几个极端特征值分离甚远时,这种成组型算法也有可能改善其收敛速度,如成组型的CG方法。 目前,这种成组型算法已体现出很大的实用计算价值,然而其进一步的理论分析还有待深入研究。     

基于LonWorks现场总线技术的氮气加热器控制系统研究

氮气加热器用于石化工业丙烯精制工程，给再生氮气加热．针对新疆独山子石化厂氮气加热器．利用LonWorks现场总线控制技术构成网络，采用前馈控制PID算法．通过周波调整法对电加热管的加热功率进行控制，在保证的规定时间内连续输出合乎温度要求的高温氮气．本控制网络的核心技术是神经元芯片(Neuron Chips)、智能网络节点和Lon Talk通信协议．本文介绍了LonWorks技术以及氮气加热控制系统总体方案与网络结构设计，节点模块设计与配置，控制电路设计，控制算法设计与软件编程．     

一种基于合作与满意的群决策方法

从信息熵和相对熵的概念出发 ,提出了“不合作度”和“不满意度”的概念 ,通过论证指出了理想合作群“不合作度”和“不满意度”均为零的特点 .针对此特点 ,建立了基于“不合作度”和“不满意度”最小的优化模型 ,并针对模型 ,对遗传算法进行改进 ,使之适合于求解模型 .最后通过算例表明了此群决策方法的有效性和实用性 .     

一种求解多峰函数优化问题的演化算法

针对演化计算产生新解无序的问题，提出了基于相似性的邻域搜索策略．利用邻域搜索，可以方便地建立自适应的新解产生机制．针对演化算法设计中存在的搜索效果和效率平衡问题，提出了利用适应值对个体进行分级的搜索策略．通过对个体的分级，可以区分个体在搜索过程中的职能：优秀的个体进行局部极小值的开采；其他的个体进行搜索空间的探索，以发现新的局部极小值．数值实验表明，新算法能有效处理低维多峰函数，能找到所有的全局最优解．对高维多峰函数．也能找到全局最优解．     

Two storage inventory model in a mixed environment

Multi-item inventory models with two storage facility and bulk release pattern are developed with linearly time dependent demand in a finite time horizon under crisp, stochastic and fuzzy-stochastic environments. Here different inventory parameters—holding costs, ordering costs, purchase costs, etc.—are assumed as probabilistic or fuzzy in nature. In particular cases stochastic and crisp models are derived. Models are formulated as profit maximization principle and three different approaches are proposed for solution. In the first approach, fuzzy extension principle is used to find membership function of the objective function and then it’s Graded Mean Integration Value (GMIV) for different optimistic levels are taken as equivalent stochastic objectives. Then the stochastic model is transformed to a constraint multi-objective programming problem using Stochastic Non-linear Programming (SNLP) technique. The multi-objective problems are transferred to single objective problems using Interactive Fuzzy Satisfising (IFS) technique. Finally, a Region Reducing Genetic Algorithm (RRGA) based on entropy has been developed and implemented to solve the single objective problems. In the second approach, the above GMIV (which is stochastic in nature) is optimized with some degree of probability and using SNLP technique model is transferred to an equivalent single objective crisp problem and solved using RRGA. In the third approach, objective function is optimized with some degree of possibility/necessity and following this approach model is transformed to an equivalent constrained stochastic programming problem. Then it is transformed to an equivalent single objective crisp problem using SNLP technique and solved via RRGA. The models are illustrated with some numerical examples and some sensitivity analyses have been presented.     

A mesh stability study of FEM explicit algorithms for structural large-scale deformation impact responses

To FEM explicit algorithms for structural large-scale deformation impact responses, algorithm stability is discussed in the present paper. Algorithm stability is thought to include two aspects: One is called difference pattern stability and the other is called mesh stability. A self-adaptive adjusting method is proposed to ensure mesh stability with little amount of computation increased.